import java.util.Arrays;

public class Test {
    public static void main(String[] args) {
        int[][] arr = {{1,1},{0,0},{3,3}};
        String s = "0";
        Arrays.sort(arr,(a,b)->a[0]-b[0]);
        for (int[] x: arr) {
            System.out.println(x[0]+" "+x[1]);
        }
    }
}
class Solution {
    public boolean checkStrings(String s1, String s2) {
        int[] a = new int[26];
        int[] b = new int[26];
        for(int i=0; i<s1.length(); i+=2){
            a[s1.charAt(i)-'a']++;
            a[s2.charAt(i)-'a']--;
            if(i+1<s1.length()){
                b[s1.charAt(i+1)-'a']++;
                b[s2.charAt(i+1)-'a']--;
            }
        }
        for(int i=0; i<26; i++){
            if(a[i]!=0 || b[i]!=0)
                return false;
        }
        return true;
    }
}
class Solution2 {
    public int countSymmetricIntegers(int low, int high) {
        int ans = 0;
        for(int i=low; i<=high; i++){
            if(i>10 && isVaild(i)){
                ans++;
                System.out.println(i);
            }
        }
        return ans;
    }
    boolean isVaild(int i){
        int sum1 = 0, sum2 = 0;
        String s = String.valueOf(i);
        int n = s.length();
        if(n%2 == 1) return false;
        for(int j=0; j<n/2; j++){
            sum1 += (int)(s.charAt(j)-'0');
            sum2 += (int)(s.charAt(n-j-1)-'0');
        }
        return sum1==sum2;
    }
}
class Solution1 {
    public int minimumOperations(String num) {
        int cnt = 0;//0,2,5,7
        int index0 = num.lastIndexOf('0'+"");
        int index2 = num.lastIndexOf('2'+"");
        int index5 = num.lastIndexOf('5'+"");
        int index7 = num.lastIndexOf('7'+"");
        int ans = 100;
        if(index0 >= 0){
            for(int i=index0-1; i>=0; i--){
                char ch = num.charAt(i);
                System.out.println(ch);
                if(ch=='0'||ch=='5'){
                    ans = num.length()-i-2;
                    break;
                }
            }
        }
        if(index5 >= 0)
            for(int i=index5-1; i>=0; i--){
                char ch = num.charAt(i);
                if(ch=='2'||ch=='7'){
                    ans = Math.min(ans,num.length()-i-2);
                    break;
                }
            }
        if(ans != 100) return ans;
        for(int i=0; i<num.length(); i++){
            if(num.charAt(i)=='0')
                cnt++;
        }
        return num.length()-cnt;
    }
}